Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
351	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 A Distributed Algorithm for Approximate Mobile Sensor Coverage Esther Ezra∗ Jiemin Zeng† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-07-29 13:44:18 NP-complete problems Complexity classes Approximation algorithms Operations research Set cover problem Polynomial-time approximation scheme Time complexity Linear programming relaxation NP Theoretical computer science Computational complexity theory Applied mathematics
352	CCCG 2011, Toronto ON, August 10–12, 2011 Computing k-Link Visibility Polygons in Environments with a Reflective Edge Salma S. Mahdavi ∗ Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:15 Visibility polygon Art gallery problem Polygon Shading Vertex Area Computational geometry Star-shaped polygon Polygon triangulation Geometry Polygons Simple polygon
353	Public-Key Cryptography from Different Assumptions Benny Applebaum∗ Boaz Barak† Avi Wigderson‡ Add to Reading List Source URL: www.boazbarak.org Language: English - Date: 2011-10-10 23:51:30 Electronic commerce Computational hardness assumptions Hidden Field Equations Pseudorandom generator RSA XTR Learning with errors Clique problem One-way function Cryptography Finite fields Public-key cryptography
354	16th Canadian Conference on Computational Geometry, 2004 Approximating optimal paths in terrains with weight defined by a piecewise-linear function J. A. P´erez Ruy-D´ıaz Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-08-23 15:27:23 Curves NP-complete problems Network theory Routing algorithms Steiner tree problem Shortest path problem A* search algorithm Catenary Graph Graph theory Mathematics Theoretical computer science
355	Why is P Not Equal to N P ? ? Michael Fellows1,2 and Frances Rosamond1 1 Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-05 20:05:44 Complexity classes NP-complete problems Mathematical optimization Structural complexity theory Parameterized complexity P versus NP problem NP-complete NP-hard NP Theoretical computer science Computational complexity theory Applied mathematics
356	CCCG 2011, Toronto ON, August 10–12, 2011 Finding Optimal Geodesic Bridges Between Two Simple Polygons Amit M. Bhosle∗ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:16 Computational geometry Discrete geometry Euclidean plane geometry Simple polygon Geodesic Vertex Distance Voronoi diagram Art gallery problem Geometry Mathematics Polygons
357	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Triangulating and Guarding Realistic Polygons G. Aloupis ∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:01:26 Art gallery problem Polygon triangulation Monotone polygon Star-shaped polygon Polygon Visibility polygon Binary space partitioning Vertex Computational geometry Geometry Polygons Simple polygon
358	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 On a geometric approach to the segment sum problem and its generalization Asish Mukhopadhyay Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:30:20 Analysis of algorithms Time complexity Algorithm Selection algorithm SL Theoretical computer science Computational complexity theory Applied mathematics
359	CS 373 Final Exam (December 15, 2000) Fall 2000 Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:48:10 Complexity classes NP-complete problems Mathematical optimization NP-hard Time complexity NP Independent set P versus NP problem Clique Theoretical computer science Computational complexity theory Applied mathematics
360	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 On Exact Solution of a Point-Location Problem in a System of d-dimensional Hyperbolic Surfaces M. L. Gavrilova∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-01-08 18:44:31 Mathematics Computational geometry Voronoi diagram Delaunay triangulation Spheres Motion planning Geometry Discrete geometry Diagrams

UPDATE